Time-bound product returns and optimal order quantities for mass merchandisers
نویسندگان
چکیده
Time-bound product returns and optimal order quantities for mass merchandisers Min-Chun Yu a & Mark Goh b c a Department of Business Administration, National Kaohsiung University of Applied Sciences, 415 Chien Kung Road, Kaohsiung 807, Taiwan, ROC b NUS Business School, National University of Singapore, Singapore 117592, Singapore c School of Management, University of South Australia, Adelaide, SA, Australia
منابع مشابه
An Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملA Multi-Periodic Multi-Product Inventory Control Problem with Discount: GA Optimization Algorithm
In this article, a finite horizon, multi product and multi period economic order quantity like seasonal items is considered where demand rate is deterministic and known but variable in each period. The order quantities of items come in batch sizes and the end of the period order quantity and, consequently, demand of customers are zero. In addition, storage space is constrained and the problem...
متن کاملRisk premiums and certainty equivalents of loss-averse newsvendors of bounded utility
Loss-averse behavior makes the newsvendors avoid the losses more than seeking the probable gains as the losses have more psychological impact on the newsvendor than the gains. In economics and decision theory, the classical newsvendor models treat losses and gains equally likely, by disregarding the expected utility when the newsvendor is loss-averse. Moreover, the use of unbounded utility to m...
متن کاملSeparable programming problems with the max-product fuzzy relation equation constraints
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Systems Science
دوره 43 شماره
صفحات -
تاریخ انتشار 2012